Gray codes for reflection groups

Let G be a finite group generated by reflections. It is shown that the elements of G can be arranged in a cycle (a "Gray. code") such that each element is obtained from the previous one by applying one of the generators. The case G = d[ ' yields a conventional binary Gray code. These generalized Gray codes provide an efficient wa), to run through the elements of any finite reflection group.